Selected partial inverse combinatorial optimization problems with forbidden elements
نویسنده
چکیده
We study the computational complexity of some special partial inverse combinatorial optimization problems where the goal is to change a parameter at minimum cost such that there exists an optimal solution for the underlying combinatorial optimization problem with respect to the modified parameter that does not contain a prespecified set of forbidden elements. We show that the partial inverse problems that arise for the shortest path, minimum cut and assignment problem where the modification cost is measured by the weighted L1or weighted L∞-norm are strongly NP-hard.
منابع مشابه
Partial inverse assignment problems under l1 norm
In this paper, we consider the partial inverse assignment problem under l1 norm without bound constraints. We show that the partial inverse problem can be solved by a strongly polynomial algorithm. The technique for solving this problem can be extended to handle a special type of partial inverse 0.1 combinatorial optimization problems. © 2006 Elsevier B.V. All rights reserved.
متن کاملRecovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems
A hybrid heuristic method for combinatorial optimization problems is proposed that combines di erent classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution...
متن کاملSampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
We consider twoand multistage versions of stochastic combinatorial optimization problems with recourse: in this framework, the instance for the combinatorial optimization problem is drawn from a known probability distribution π and is only revealed to the algorithm over two (or multiple) stages. At each stage, on receiving some more information about the instance, the algorithm is allowed to bu...
متن کاملInverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
Given a (combinatorial) optimization problem and a feasible solution to it, the corresponding inverse optimization problem is to find a minimal adjustment of the cost function such that the given solution becomes optimum. Several such problems have been studied in the last ten years. After formalizing the notion of an inverse problem and its variants, we present various methods for solving them...
متن کاملThe Base-matroid and Inverse Combinatorial Optimization Problems
A new matroid is introduced: this matroid is de0ned starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has application in the 0eld of inverse combinatorial optimization problems. We discuss in detail the LP fo...
متن کامل